Asymptotic approximations to the Bayes posterior risk
نویسندگان
چکیده
منابع مشابه
Asymptotic approximations to posterior distributions via conditional moment equations
We consider asymptotic approximations to joint posterior distributions in situations where the full conditional distributions referred to in Gibbs sampling are asymptotically normal. Our development focuses on problems where data augmentation facilitates simpler calculations, but results hold more generally. Asymptotic mean vectors are obtained as simultaneous solutions to fixed point equations...
متن کاملAsymptotic Approximations of the Solution for a Traveling String under Boundary Damping
Transversal vibrations of an axially moving string under boundary damping are investigated. Mathematically, it represents a homogenous linear partial differential equation subject to nonhomogeneous boundary conditions. The string is moving with a relatively (low) constant speed, which is considered to be positive. The string is kept fixed at the first end, while the other end is tied with the ...
متن کاملOn multi-Bernoulli approximations to the Bayes multi-target filter
Mahler recently proposed the Multitarget Multi-Bernoulli (MeMBer) recursion as a tractable approximation to the Bayes multi-target recursion, and outlined a Gaussian mixture solution under linear Gaussian assumptions. These proposals are speculative in the sense that, to date, no implementations have been reported. In this paper, it is shown analytically that the MeMBer recursion has a signific...
متن کاملAsymptotic Approximations for n !
Several approximations for n! have recently appeared in the literature. We show here how these approximations can be derived by expansion of certain polynomials in inverse powers of n and comparison with Stirling’s asymptotic series. Some new approximations are also given. The same procedure is applied to generate approximations for the ratio of two gamma functions.
متن کاملBayes risk approximations using time overlap with an application to system combination
The computation of the Minimum Bayes Risk (MBR) decoding rule for word lattices needs approximations. We investigate a class of approximations where the Levenshtein alignment is approximated under the condition that competing lattice arcs overlap in time. The approximations have their origins in MBR decoding and in discriminative training. We develop modified versions and propose a new, concept...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Stochastic Analysis
سال: 1990
ISSN: 1048-9533,1687-2177
DOI: 10.1155/s1048953390000090